Decoding by Sampling — Part II: Derandomization and Soft-Output Decoding
نویسندگان
چکیده
منابع مشابه
Decoding by Sampling - Part II: Derandomization and Soft-Output Decoding
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, w...
متن کاملLow-complexity soft-decoding algorithms for Reed-Solomon codes-part II: soft-input soft-output iterative decoding
In this work we present a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which the output produced by steps of Belief-Propagation (BP) is successively applied to a legacy decoding algorithm. Due to the suboptimal performance of BP conducted on the inherently dense RS parity-check matrix, a method is first provided f...
متن کاملSoft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes
In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a poster...
متن کاملAn Efficient Best-First Derandomization Sampling Algorithm for Lattice Decoding
Although lattice reduction aided decoding improves the decoding performance, it has a performance gap to Maximum Likelihood (ML) decoding increasing with the lattice dimension. In view of this, efficient suboptimal decoding algorithms that can narrow the gap are desirable. In this paper, an efficient Best-First Derandomized Sampling (BFDS) decoding algorithm is proposed to achieve near optimal ...
متن کاملInformation Processing in Soft–Output Decoding
Recent literature presents methods for the analysis of concatenated coding schemes by solely characterizing the behavior of the component codes [4, 12, 14, 9, 7]. Component codes are analyzed either analytically using unique properties of special component codes, e.g., single–parity–check code or accumulator, or via simulations. The goals of this paper are to find fundamental insights into conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2013
ISSN: 0090-6778
DOI: 10.1109/tcomm.2013.101813.130500